package org.blogwu.learn.algorithm.树.二叉搜索树;

public class _判断是否为完全二叉树 {

    public static void main(String[] args) {
        BinarySearchTree<Integer> tree = TreeTest.getCompleteTreeAndPrint();
        System.out.println("");
//        System.out.println(tree.isComplete(tree.getRoot()));
        System.out.println(tree.isComplete2(tree.getRoot()));
    }


}
